A Partial Condition Number for Linear Least Squares Problems
نویسندگان
چکیده
Abstract. We consider here the linear least squares problem miny∈Rn ‖Ay− b‖2, where b ∈ Rm and A ∈ Rm×n is a matrix of full column rank n, and we denote x its solution. We assume that both A and b can be perturbed and that these perturbations are measured using the Frobenius or the spectral norm for A and the Euclidean norm for b. In this paper, we are concerned with the condition number of a linear function of x (LT x, where L ∈ Rn×k) for which we provide a sharp estimate that lies within a factor √ 3 of the true condition number. Provided the triangular R factor of A from ATA = RTR is available, this estimate can be computed in 2kn2 flops. We also propose a statistical method that estimates the partial condition number by using the exact condition numbers in random orthogonal directions. If R is available, this statistical approach enables us to obtain a condition estimate at a lower computational cost. In the case of the Frobenius norm, we derive a closed formula for the partial condition number that is based on the singular values and the right singular vectors of the matrix A.
منابع مشابه
Radial function collocation solution of partial differential equations in irregular domains
We consider a collocation method using radial functions for the solution of partial differential equations in irregular domains. We use a regularised least squares approach to solve the potentially ill-conditioned problems that may arise. This meshless method is easy to implement and eliminates most of the problems that mesh oriented methods have with irregular boundaries and complicated domain...
متن کاملSimultaneous spectrophotometric determination of lead, copper and nickel using xylenol orange by partial least squares
A partial least squares (PLS) calibration model was developed for the simultaneous spectrophotometricdetermination of Pb (ΙΙ), Cu (ΙΙ) and Ni (ΙΙ) using xylenol orange as a chromogenic reagent. The parameterscontrolling behavior of the system were investigated and optimum conditions were selected. The calibrationgraphs were linear in the ranges of 0.0–9.091, 0.0–2.719 and 0.0–2.381 ppm for lead...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملFirst-order System Least- Squares for Second-order Partial Diierential Equations: Part Ii. Siam J
analysis of iterative substructuring algorithms for elliptic problems in three dimensions. Least-squares mixed-nite elements for second-order elliptic problems. A least-squares approach based on a discrete minus one inner product for rst order systems. Technical report, Brookhaven National Laboratory, 1994. 4] J. H. Bramble and J. E. Pasciak. Least-squares methods for Stokes equations based on ...
متن کاملPreconditioning of linear least-squares problems by identifying basic variables
The preconditioning of linear least-squares problems is a hard task. The linear model underpinning least-squares problems, that is the overdetermined matrix defining it, does not have the properties of differential problems that make standard preconditioners effective. Incomplete Cholesky techniques applied to the normal equations do not produce a well conditioned problem. We attempt to remove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 29 شماره
صفحات -
تاریخ انتشار 2007